TSTP Solution File: NUM796^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : NUM796^1 : TPTP v8.1.0. Released v3.7.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 11:55:37 EDT 2022
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of formulae : 60 ( 34 unt; 10 typ; 0 def)
% Number of atoms : 210 ( 56 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 343 ( 31 ~; 38 |; 0 &; 264 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 96 ( 0 ^ 96 !; 0 ?; 96 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_rat,type,
rat: $tType ).
thf(tp_less,type,
less: rat > rat > $o ).
thf(tp_lessis,type,
lessis: rat > rat > $o ).
thf(tp_more,type,
more: rat > rat > $o ).
thf(tp_moreis,type,
moreis: rat > rat > $o ).
thf(tp_pl,type,
pl: rat > rat > rat ).
thf(tp_u0,type,
u0: rat ).
thf(tp_x0,type,
x0: rat ).
thf(tp_y0,type,
y0: rat ).
thf(tp_z0,type,
z0: rat ).
thf(1,axiom,
! [Xx0: rat,Xy0: rat] :
( ( lessis @ Xx0 @ Xy0 )
=> ( moreis @ Xy0 @ Xx0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz85) ).
thf(2,axiom,
! [Xx0: rat,Xy0: rat] :
( ( less @ Xx0 @ Xy0 )
=> ( more @ Xy0 @ Xx0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz83) ).
thf(3,axiom,
! [Xx0: rat,Xy0: rat,Xz0: rat,Xu0: rat] :
( ( more @ Xx0 @ Xy0 )
=> ( ( moreis @ Xz0 @ Xu0 )
=> ( more @ ( pl @ Xx0 @ Xz0 ) @ ( pl @ Xy0 @ Xu0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz99b) ).
thf(4,axiom,
! [Xx0: rat,Xy0: rat] :
( ( more @ Xx0 @ Xy0 )
=> ( less @ Xy0 @ Xx0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz82) ).
thf(5,axiom,
lessis @ z0 @ u0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
thf(6,axiom,
less @ x0 @ y0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
thf(7,conjecture,
less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz99d) ).
thf(8,negated_conjecture,
( ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) )
= $false ),
inference(negate_conjecture,[status(cth)],[7]) ).
thf(9,plain,
( ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) )
= $false ),
inference(unfold_def,[status(thm)],[8]) ).
thf(10,plain,
( ( ! [Xx0: rat,Xy0: rat] :
( ( lessis @ Xx0 @ Xy0 )
=> ( moreis @ Xy0 @ Xx0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(11,plain,
( ( ! [Xx0: rat,Xy0: rat] :
( ( less @ Xx0 @ Xy0 )
=> ( more @ Xy0 @ Xx0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(12,plain,
( ( ! [Xx0: rat,Xy0: rat,Xz0: rat,Xu0: rat] :
( ( more @ Xx0 @ Xy0 )
=> ( ( moreis @ Xz0 @ Xu0 )
=> ( more @ ( pl @ Xx0 @ Xz0 ) @ ( pl @ Xy0 @ Xu0 ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(13,plain,
( ( ! [Xx0: rat,Xy0: rat] :
( ( more @ Xx0 @ Xy0 )
=> ( less @ Xy0 @ Xx0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(14,plain,
( ( lessis @ z0 @ u0 )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(15,plain,
( ( less @ x0 @ y0 )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(16,plain,
( ( ~ ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[9]) ).
thf(17,plain,
( ( ! [Xx0: rat,Xy0: rat] :
( ~ ( lessis @ Xx0 @ Xy0 )
| ( moreis @ Xy0 @ Xx0 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[10]) ).
thf(18,plain,
( ( ! [Xx0: rat,Xy0: rat] :
( ~ ( less @ Xx0 @ Xy0 )
| ( more @ Xy0 @ Xx0 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[11]) ).
thf(19,plain,
( ( ! [Xx0: rat,Xy0: rat] :
( ~ ( more @ Xx0 @ Xy0 )
| ! [Xz0: rat,Xu0: rat] :
( ~ ( moreis @ Xz0 @ Xu0 )
| ( more @ ( pl @ Xx0 @ Xz0 ) @ ( pl @ Xy0 @ Xu0 ) ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[12]) ).
thf(20,plain,
( ( ! [Xx0: rat,Xy0: rat] :
( ~ ( more @ Xx0 @ Xy0 )
| ( less @ Xy0 @ Xx0 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[13]) ).
thf(21,plain,
( ( less @ x0 @ y0 )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(22,plain,
( ( lessis @ z0 @ u0 )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(23,plain,
( ( ! [Xx0: rat,Xy0: rat] :
( ~ ( more @ Xx0 @ Xy0 )
| ( less @ Xy0 @ Xx0 ) ) )
= $true ),
inference(copy,[status(thm)],[20]) ).
thf(24,plain,
( ( ! [Xx0: rat,Xy0: rat] :
( ~ ( more @ Xx0 @ Xy0 )
| ! [Xz0: rat,Xu0: rat] :
( ~ ( moreis @ Xz0 @ Xu0 )
| ( more @ ( pl @ Xx0 @ Xz0 ) @ ( pl @ Xy0 @ Xu0 ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[19]) ).
thf(25,plain,
( ( ! [Xx0: rat,Xy0: rat] :
( ~ ( less @ Xx0 @ Xy0 )
| ( more @ Xy0 @ Xx0 ) ) )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(26,plain,
( ( ! [Xx0: rat,Xy0: rat] :
( ~ ( lessis @ Xx0 @ Xy0 )
| ( moreis @ Xy0 @ Xx0 ) ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(27,plain,
( ( ~ ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) ) )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(28,plain,
! [SV1: rat] :
( ( ! [SY10: rat] :
( ~ ( more @ SV1 @ SY10 )
| ( less @ SY10 @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(29,plain,
! [SV2: rat] :
( ( ! [SY11: rat] :
( ~ ( more @ SV2 @ SY11 )
| ! [SY12: rat,SY13: rat] :
( ~ ( moreis @ SY12 @ SY13 )
| ( more @ ( pl @ SV2 @ SY12 ) @ ( pl @ SY11 @ SY13 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(30,plain,
! [SV3: rat] :
( ( ! [SY14: rat] :
( ~ ( less @ SV3 @ SY14 )
| ( more @ SY14 @ SV3 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[25]) ).
thf(31,plain,
! [SV4: rat] :
( ( ! [SY15: rat] :
( ~ ( lessis @ SV4 @ SY15 )
| ( moreis @ SY15 @ SV4 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[26]) ).
thf(32,plain,
( ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[27]) ).
thf(33,plain,
! [SV5: rat,SV1: rat] :
( ( ~ ( more @ SV1 @ SV5 )
| ( less @ SV5 @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[28]) ).
thf(34,plain,
! [SV6: rat,SV2: rat] :
( ( ~ ( more @ SV2 @ SV6 )
| ! [SY16: rat,SY17: rat] :
( ~ ( moreis @ SY16 @ SY17 )
| ( more @ ( pl @ SV2 @ SY16 ) @ ( pl @ SV6 @ SY17 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[29]) ).
thf(35,plain,
! [SV7: rat,SV3: rat] :
( ( ~ ( less @ SV3 @ SV7 )
| ( more @ SV7 @ SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(36,plain,
! [SV8: rat,SV4: rat] :
( ( ~ ( lessis @ SV4 @ SV8 )
| ( moreis @ SV8 @ SV4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(37,plain,
! [SV5: rat,SV1: rat] :
( ( ( ~ ( more @ SV1 @ SV5 ) )
= $true )
| ( ( less @ SV5 @ SV1 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[33]) ).
thf(38,plain,
! [SV6: rat,SV2: rat] :
( ( ( ~ ( more @ SV2 @ SV6 ) )
= $true )
| ( ( ! [SY16: rat,SY17: rat] :
( ~ ( moreis @ SY16 @ SY17 )
| ( more @ ( pl @ SV2 @ SY16 ) @ ( pl @ SV6 @ SY17 ) ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[34]) ).
thf(39,plain,
! [SV7: rat,SV3: rat] :
( ( ( ~ ( less @ SV3 @ SV7 ) )
= $true )
| ( ( more @ SV7 @ SV3 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[35]) ).
thf(40,plain,
! [SV8: rat,SV4: rat] :
( ( ( ~ ( lessis @ SV4 @ SV8 ) )
= $true )
| ( ( moreis @ SV8 @ SV4 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[36]) ).
thf(41,plain,
! [SV5: rat,SV1: rat] :
( ( ( more @ SV1 @ SV5 )
= $false )
| ( ( less @ SV5 @ SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[37]) ).
thf(42,plain,
! [SV6: rat,SV2: rat] :
( ( ( more @ SV2 @ SV6 )
= $false )
| ( ( ! [SY16: rat,SY17: rat] :
( ~ ( moreis @ SY16 @ SY17 )
| ( more @ ( pl @ SV2 @ SY16 ) @ ( pl @ SV6 @ SY17 ) ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[38]) ).
thf(43,plain,
! [SV7: rat,SV3: rat] :
( ( ( less @ SV3 @ SV7 )
= $false )
| ( ( more @ SV7 @ SV3 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[39]) ).
thf(44,plain,
! [SV8: rat,SV4: rat] :
( ( ( lessis @ SV4 @ SV8 )
= $false )
| ( ( moreis @ SV8 @ SV4 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[40]) ).
thf(45,plain,
! [SV6: rat,SV2: rat,SV9: rat] :
( ( ( ! [SY18: rat] :
( ~ ( moreis @ SV9 @ SY18 )
| ( more @ ( pl @ SV2 @ SV9 ) @ ( pl @ SV6 @ SY18 ) ) ) )
= $true )
| ( ( more @ SV2 @ SV6 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[42]) ).
thf(46,plain,
! [SV6: rat,SV2: rat,SV10: rat,SV9: rat] :
( ( ( ~ ( moreis @ SV9 @ SV10 )
| ( more @ ( pl @ SV2 @ SV9 ) @ ( pl @ SV6 @ SV10 ) ) )
= $true )
| ( ( more @ SV2 @ SV6 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[45]) ).
thf(47,plain,
! [SV6: rat,SV2: rat,SV10: rat,SV9: rat] :
( ( ( ~ ( moreis @ SV9 @ SV10 ) )
= $true )
| ( ( more @ ( pl @ SV2 @ SV9 ) @ ( pl @ SV6 @ SV10 ) )
= $true )
| ( ( more @ SV2 @ SV6 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[46]) ).
thf(48,plain,
! [SV6: rat,SV2: rat,SV10: rat,SV9: rat] :
( ( ( moreis @ SV9 @ SV10 )
= $false )
| ( ( more @ ( pl @ SV2 @ SV9 ) @ ( pl @ SV6 @ SV10 ) )
= $true )
| ( ( more @ SV2 @ SV6 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[47]) ).
thf(49,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[21,48,44,43,41,32,22]) ).
thf(50,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM796^1 : TPTP v8.1.0. Released v3.7.0.
% 0.07/0.14 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jul 6 05:08:29 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36
% 0.14/0.36 No.of.Axioms: 6
% 0.14/0.36
% 0.14/0.36 Length.of.Defs: 0
% 0.14/0.36
% 0.14/0.36 Contains.Choice.Funs: false
% 0.14/0.36 (rf:0,axioms:6,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:8,loop_count:0,foatp_calls:0,translation:fof_full)..
% 0.14/0.40
% 0.14/0.40 ********************************
% 0.14/0.40 * All subproblems solved! *
% 0.14/0.40 ********************************
% 0.14/0.40 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:6,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:49,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.14/0.40
% 0.14/0.40 %**** Beginning of derivation protocol ****
% 0.14/0.40 % SZS output start CNFRefutation
% See solution above
% 0.14/0.40
% 0.14/0.40 %**** End of derivation protocol ****
% 0.14/0.40 %**** no. of clauses in derivation: 50 ****
% 0.14/0.40 %**** clause counter: 49 ****
% 0.14/0.40
% 0.14/0.40 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:6,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:49,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------